'Weak Dependency Graph [60.0]'
------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ a(x1) -> x1
, a(a(b(x1))) -> c(c(b(a(x1))))
, b(c(x1)) -> a(b(x1))}
Details:
We have computed the following set of weak (innermost) dependency pairs:
{ a^#(x1) -> c_0()
, a^#(a(b(x1))) -> c_1(b^#(a(x1)))
, b^#(c(x1)) -> c_2(a^#(b(x1)))}
The usable rules are:
{ a(x1) -> x1
, a(a(b(x1))) -> c(c(b(a(x1))))
, b(c(x1)) -> a(b(x1))}
The estimated dependency graph contains the following edges:
{a^#(a(b(x1))) -> c_1(b^#(a(x1)))}
==> {b^#(c(x1)) -> c_2(a^#(b(x1)))}
{b^#(c(x1)) -> c_2(a^#(b(x1)))}
==> {a^#(a(b(x1))) -> c_1(b^#(a(x1)))}
{b^#(c(x1)) -> c_2(a^#(b(x1)))}
==> {a^#(x1) -> c_0()}
We consider the following path(s):
1) { a^#(a(b(x1))) -> c_1(b^#(a(x1)))
, b^#(c(x1)) -> c_2(a^#(b(x1)))}
The usable rules for this path are the following:
{ a(x1) -> x1
, a(a(b(x1))) -> c(c(b(a(x1))))
, b(c(x1)) -> a(b(x1))}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ a(x1) -> x1
, a(a(b(x1))) -> c(c(b(a(x1))))
, b(c(x1)) -> a(b(x1))
, a^#(a(b(x1))) -> c_1(b^#(a(x1)))
, b^#(c(x1)) -> c_2(a^#(b(x1)))}
Details:
We apply the weight gap principle, strictly orienting the rules
{b^#(c(x1)) -> c_2(a^#(b(x1)))}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{b^#(c(x1)) -> c_2(a^#(b(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0() = [0]
c_1(x1) = [1] x1 + [1]
b^#(x1) = [1] x1 + [2]
c_2(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{b(c(x1)) -> a(b(x1))}
and weakly orienting the rules
{b^#(c(x1)) -> c_2(a^#(b(x1)))}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{b(c(x1)) -> a(b(x1))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [8]
a^#(x1) = [1] x1 + [0]
c_0() = [0]
c_1(x1) = [1] x1 + [5]
b^#(x1) = [1] x1 + [12]
c_2(x1) = [1] x1 + [2]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a^#(a(b(x1))) -> c_1(b^#(a(x1)))}
and weakly orienting the rules
{ b(c(x1)) -> a(b(x1))
, b^#(c(x1)) -> c_2(a^#(b(x1)))}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a^#(a(b(x1))) -> c_1(b^#(a(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [8]
a^#(x1) = [1] x1 + [9]
c_0() = [0]
c_1(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [8]
c_2(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a(x1) -> x1}
and weakly orienting the rules
{ a^#(a(b(x1))) -> c_1(b^#(a(x1)))
, b(c(x1)) -> a(b(x1))
, b^#(c(x1)) -> c_2(a^#(b(x1)))}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a(x1) -> x1}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [8]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [10]
a^#(x1) = [1] x1 + [1]
c_0() = [0]
c_1(x1) = [1] x1 + [1]
b^#(x1) = [1] x1 + [0]
c_2(x1) = [1] x1 + [0]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {a(a(b(x1))) -> c(c(b(a(x1))))}
Weak Rules:
{ a(x1) -> x1
, a^#(a(b(x1))) -> c_1(b^#(a(x1)))
, b(c(x1)) -> a(b(x1))
, b^#(c(x1)) -> c_2(a^#(b(x1)))}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {a(a(b(x1))) -> c(c(b(a(x1))))}
Weak Rules:
{ a(x1) -> x1
, a^#(a(b(x1))) -> c_1(b^#(a(x1)))
, b(c(x1)) -> a(b(x1))
, b^#(c(x1)) -> c_2(a^#(b(x1)))}
Details:
The problem is Match-bounded by 2.
The enriched problem is compatible with the following automaton:
{ a_0(3) -> 14
, a_0(9) -> 9
, a_1(3) -> 12
, a_1(15) -> 11
, a_1(15) -> 15
, a_1(15) -> 18
, a_2(3) -> 19
, b_0(3) -> 9
, b_1(3) -> 11
, b_1(3) -> 15
, b_1(3) -> 18
, b_1(12) -> 11
, b_2(19) -> 18
, c_0(3) -> 3
, c_0(3) -> 12
, c_0(3) -> 14
, c_0(3) -> 19
, c_1(10) -> 9
, c_1(11) -> 10
, c_2(17) -> 11
, c_2(17) -> 15
, c_2(17) -> 18
, c_2(18) -> 17
, a^#_0(3) -> 4
, a^#_0(9) -> 8
, a^#_1(15) -> 16
, c_1_0(13) -> 8
, c_1_1(20) -> 16
, b^#_0(3) -> 7
, b^#_0(14) -> 13
, b^#_1(12) -> 20
, c_2_0(8) -> 7
, c_2_1(16) -> 7
, c_2_1(16) -> 13
, c_2_1(16) -> 20}
2) { a^#(a(b(x1))) -> c_1(b^#(a(x1)))
, b^#(c(x1)) -> c_2(a^#(b(x1)))
, a^#(x1) -> c_0()}
The usable rules for this path are the following:
{ a(x1) -> x1
, a(a(b(x1))) -> c(c(b(a(x1))))
, b(c(x1)) -> a(b(x1))}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ a(x1) -> x1
, a(a(b(x1))) -> c(c(b(a(x1))))
, b(c(x1)) -> a(b(x1))
, a^#(a(b(x1))) -> c_1(b^#(a(x1)))
, b^#(c(x1)) -> c_2(a^#(b(x1)))
, a^#(x1) -> c_0()}
Details:
We apply the weight gap principle, strictly orienting the rules
{a^#(x1) -> c_0()}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a^#(x1) -> c_0()}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0() = [0]
c_1(x1) = [1] x1 + [1]
b^#(x1) = [1] x1 + [0]
c_2(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a^#(a(b(x1))) -> c_1(b^#(a(x1)))}
and weakly orienting the rules
{a^#(x1) -> c_0()}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a^#(a(b(x1))) -> c_1(b^#(a(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0() = [0]
c_1(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [0]
c_2(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{ b(c(x1)) -> a(b(x1))
, b^#(c(x1)) -> c_2(a^#(b(x1)))}
and weakly orienting the rules
{ a^#(a(b(x1))) -> c_1(b^#(a(x1)))
, a^#(x1) -> c_0()}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ b(c(x1)) -> a(b(x1))
, b^#(c(x1)) -> c_2(a^#(b(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [8]
a^#(x1) = [1] x1 + [0]
c_0() = [0]
c_1(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [0]
c_2(x1) = [1] x1 + [3]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a(x1) -> x1}
and weakly orienting the rules
{ b(c(x1)) -> a(b(x1))
, b^#(c(x1)) -> c_2(a^#(b(x1)))
, a^#(a(b(x1))) -> c_1(b^#(a(x1)))
, a^#(x1) -> c_0()}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a(x1) -> x1}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [8]
b(x1) = [1] x1 + [0]
c(x1) = [1] x1 + [8]
a^#(x1) = [1] x1 + [4]
c_0() = [0]
c_1(x1) = [1] x1 + [1]
b^#(x1) = [1] x1 + [1]
c_2(x1) = [1] x1 + [1]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {a(a(b(x1))) -> c(c(b(a(x1))))}
Weak Rules:
{ a(x1) -> x1
, b(c(x1)) -> a(b(x1))
, b^#(c(x1)) -> c_2(a^#(b(x1)))
, a^#(a(b(x1))) -> c_1(b^#(a(x1)))
, a^#(x1) -> c_0()}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {a(a(b(x1))) -> c(c(b(a(x1))))}
Weak Rules:
{ a(x1) -> x1
, b(c(x1)) -> a(b(x1))
, b^#(c(x1)) -> c_2(a^#(b(x1)))
, a^#(a(b(x1))) -> c_1(b^#(a(x1)))
, a^#(x1) -> c_0()}
Details:
The problem is Match-bounded by 2.
The enriched problem is compatible with the following automaton:
{ a_0(3) -> 11
, a_0(9) -> 9
, a_1(3) -> 14
, a_1(15) -> 13
, a_1(15) -> 15
, a_1(15) -> 19
, a_2(3) -> 20
, b_0(3) -> 9
, b_1(3) -> 13
, b_1(3) -> 15
, b_1(3) -> 19
, b_1(14) -> 13
, b_2(20) -> 19
, c_0(3) -> 3
, c_0(3) -> 11
, c_0(3) -> 14
, c_0(3) -> 20
, c_1(12) -> 9
, c_1(13) -> 12
, c_2(18) -> 13
, c_2(18) -> 15
, c_2(18) -> 19
, c_2(19) -> 18
, a^#_0(3) -> 4
, a^#_0(9) -> 8
, a^#_1(15) -> 16
, c_0_0() -> 4
, c_0_0() -> 8
, c_0_1() -> 16
, c_1_0(10) -> 8
, c_1_1(17) -> 16
, b^#_0(3) -> 7
, b^#_0(11) -> 10
, b^#_1(14) -> 17
, c_2_0(8) -> 7
, c_2_1(16) -> 7
, c_2_1(16) -> 10
, c_2_1(16) -> 17}